Bandwidth Utilization in Latency-Optimized Fair Queuing Algorithm
نویسندگان
چکیده
منابع مشابه
An Accommodative Adaptive Arbitration Algorithm for Maximum CPU Utilization, Fair Bandwidth Allocation and Low Latency
An adaptive algorithm for fair bandwidth allocation, low latency and maximum CPU utilization is proved to be a promising approach for designing system-on-chip for future applications. Adaptive arbitration focuses on user oriented as well as system oriented performance therefore it is more advantageous then the other conventional arbitration algorithms for several reasons; these include fair ban...
متن کاملEfficient fair queuing with decoupled delay-bandwidth guarantees
In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on an existing efficient fair scheduler, Frame-based Fair Queueing (FFQ)[1], and therefore inherits the fairness, simplicity and efficiency of that policy. We combine a slightly modified version of an FFQ scheduler with the link sharing concept using rate estimator modu...
متن کاملHierarchical Fair Queuing
In this paper, we present a new queueing algorithm for networks, called Hierarchical Fair Queueing (HFQ). This shares the bandwidth between classes of users, and (within each class) between subclasses. HFQ provides a guaranteed share of bandwidth to each class, but bandwidth is not wasted when a class is inactive. Unlike the Link Sharing scheme of Floyd-Jacobsen, HFQ is provably fair, in that t...
متن کاملRFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. Violation of the service bounds results in nullification of the performance guarantees of the misbehaving client. In this paper we relax this notion of good behavior and present a generalized service model that takes th...
متن کاملProbabilistic Fair Queuing
Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartC
سال: 2007
ISSN: 1598-2858
DOI: 10.3745/kipstc.2007.14-c.2.155